Predictability of Least Laxity First Scheduling Algorithm on Multiprocessor Real-Time Systems
نویسندگان
چکیده
A priority-driven scheduling algorithm is said to be start time (finish time) predictable if the start time (finish time) of jobs in the schedule where each job executes for its actual execution time is bounded by the start times (finish times) of jobs in the schedules where each job executes for its maximum/minimum execution time. In this paper, we study the predictability of a job-level dynamic priority algorithm, LLF (Least Laxity First), on multiprocessor real-time systems. We present a necessary and sufficient condition for a priority-driven algorithm to be start time (finish time) predictable. Then, in LLF scheduling, we show that both the start time and the finish time are predictable if the actual execution times cannot be known. However, solely the finish time is predictable if the actual execution times can be known.
منابع مشابه
A Multiprocessor System with Non-Preemptive Earliest-Deadline-First Scheduling Policy: A Performability Study
This paper introduces an analytical method for approximating the performability of a firm realtime system modeled by a multi-server queue. The service discipline in the queue is earliestdeadline- first (EDF), which is an optimal scheduling algorithm. Real-time jobs with exponentially distributed relative deadlines arrive according to a Poisson process. All jobs have deadlines until the end of s...
متن کاملLda { Scalable, Oo-line Multiprocessor Scheduling for Real-time Systems
OO-line task scheduling remains important for real-time systems since such algorithms may be used to schedule tasks known at the time of system initialization. The LDA algorithm described in this paper uses both task laxities and deadlines when deciding processor allocation and task scheduling for a multipro-cessor system. The algorithm is diierent from existing algorithms (1) in its use of dis...
متن کاملLLFpi : Schedulability-Improved LLF Algorithm in Multiprocessor Real-Time Embedded Systems
* Corresponding author Abstract As the workload of real-time applications becomes more complex, more diverse, and heavier, multiprocessor architecture and priority-driven scheduling algorithms are adopted in recent embedded systems. One of priority-driven algorithms is LLF (Least Laxity First). It assigns higher priority to active jobs with less laxity. It is known that LLF outperforms many sch...
متن کاملZero-laxity based real-time multiprocessor scheduling
It has been widely studied how to schedule real-time tasks on multiprocessor platforms. Several studies have developed optimal scheduling policies for implicit deadline task systems. So far however, studies have failed to develop effective scheduling strategies for more general task systems such as constrained deadline tasks. We argue that a narrow focus on deadline satisfaction (urgency) is th...
متن کاملPre-scheduling and Scheduling of Task Graph on Homogeneous Multiprocessor Systems
Task graph scheduling is a multi-objective optimization and NP-hard problem. In this paper a new algorithm on homogeneous multiprocessors systems is proposed. Basically, scheduling algorithms are targeted to balance the two parameters of time and energy consumption. These two parameters are up to a certain limit in contrast with each other and improvement of one causes reduction in the othe...
متن کامل